
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2274. -- [Usaco2011]Generic Cow Protests [Neal Wu, 2010] -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2274: [Usaco2011]Generic Cow Protests [Neal Wu, 2010]</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>128 MB<br><span class=green>Submit: </span>71&nbsp;&nbsp;<span class=green>Solved: </span>39<br>[<a href='submitpage.php?id=2274'>Submit</a>][<a href='problemstatus.php?id=2274'>Status</a>][<a href='bbs.php?id=2274'>Discuss</a>]</center><h2>Description</h2><div class=content><p><br />
Farmer John's N (1 &lt;= N &lt;= 100,000) cows are lined up in a row and<br />
numbered 1..N. The cows are conducting another one of their strange<br />
protests, so each cow i is holding up a sign with an integer A_i<br />
(-10,000 &lt;= A_i &lt;= 10,000).<br />
<br />
FJ knows the mob of cows will behave if they are properly grouped<br />
and thus would like to arrange the cows into one or more contiguous<br />
groups so that every cow is in exactly one group and that every<br />
group has a nonnegative sum.<br />
<br />
Help him count the number of ways he can do this, modulo 1,000,000,009.<br />
<br />
By way of example, if N = 4 and the cows' signs are 2, 3, -3, and<br />
1, then the following are the only four valid ways of arranging the<br />
cows:<br />
<br />
(2 3 -3 1)<br />
(2 3 -3) (1)<br />
(2) (3 -3 1)<br />
(2) (3 -3) (1)<br />
<br />
Note that this example demonstrates the rule for counting different<br />
orders of the arrangements.<br />
<br />
给出n个数，问有几种划分方案（不能改变数的位置），使得每组中数的和大于等于0。输出方案数除以 1000000009的余数。<br />
</p></div><h2>Input</h2><div class=content><p>* Line 1: A single integer: N<br />
<br />
* Lines 2..N + 1: Line i + 1 contains a single integer: A_i<br />
<br />
</p></div><h2>Output</h2><div class=content><p><br />
* Line 1: A single integer, the number of arrangements modulo<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1,000,000,009.<br />
</p></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>4<br />
2<br />
3<br />
-3<br />
1<br />
<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>4<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Gold'>Gold</a></p></div><center>[<a href='submitpage.php?id=2274'>Submit</a>][<a href='problemstatus.php?id=2274'>Status</a>][<a href='bbs.php?id=2274'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
